Approximation of probability distributions by k-valued logic functions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient approximation of probability distributions with k-order decomposable models

During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In t...

متن کامل

On the number of monotonic functions from two-valued logic to k-valued logic

The problem of number determination of monotonic functions of n variables-i^(n) was formulated and solved for n = 4 by Dedekind [3] in 1897. For n = 5 and n = 6, this problem was solved in Church [2] and in Ward [12] respectively. The further authors bringing the essential improvement of the estimates of \j/(n) were Gilbert [4], Korobkov [8, 9, 10], Hansel [5], and Kleitman [7] who gave an asym...

متن کامل

Approximation of Set-valued Functions by Single-valued One

Let Σ : M → 2 \ {∅} be a set-valued function defined on a Hausdorff compact topological space M and taking values in the normed space (Y, ‖·‖). We deal with the problem of finding the best Chebyshev type approximation of the set-valued function Σ by a singlevalued function g from a given closed convex set V ⊂ C(M, Y ). In an abstract setting this problem is posed as the extremal problem supt∈M ...

متن کامل

Best approximation by integer-valued functions

Given an integer function f , the problem is to find its best uniform approximation from a set K of integervalued bounded functions. Under certain conditions on K , the best extremal (maximal or minimal) approximation is identified. Furthermore, the operator mapping f to its extremal best approximation is shown to be Lipschitzian with some constant C or optimal Lipschitzian having the smallest ...

متن کامل

APPROXIMATION OF 3D-PARAMETRIC FUNCTIONS BY BICUBIC B-SPLINE FUNCTIONS

In this paper we propose a method to approximate a parametric 3 D-function by bicubic B-spline functions

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Keldysh Institute Preprints

سال: 2016

ISSN: 2071-2898,2071-2901

DOI: 10.20948/prepr-2016-58